|
In mathematics a Padé approximant is the "best" approximation of a function by a rational function of given order – under this technique, the approximant's power series agrees with the power series of the function it is approximating. The technique was developed around 1890 by Henri Padé, but goes back to Georg Frobenius who introduced the idea and investigated the features of rational approximations of power series. The Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. For these reasons Padé approximants are used extensively in computer calculations. They have also been used as auxiliary functions in Diophantine approximation and transcendental number theory, though for sharp results ''ad hoc'' methods in some sense inspired by the Padé theory typically replace them. ==Definition== Given a function ''f'' and two integers ''m'' ≥ 0 and ''n'' ≥ 1, the ''Padé approximant'' of order () is the rational function : which agrees with ''f(x)'' to the highest possible order, which amounts to :. Equivalently, if ''R(x)'' is expanded in a Maclaurin series (Taylor series at 0), its first ''m'' + ''n'' terms would cancel the first ''m'' + ''n'' terms of ''f(x)'', and as such: : The Padé approximant is unique for given ''m'' and ''n'', that is, the coefficients can be uniquely determined. It is for reasons of uniqueness that the zero-th order term at the denominator of ''R(x)'' was chosen to be 1, otherwise the numerator and denominator of ''R(x)'' would have been unique only up to multiplication by a constant. The Padé approximant defined above is also denoted as : 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Padé approximant」の詳細全文を読む スポンサード リンク
|